On the Nonlinear Complementarity Problem

نویسندگان

  • MUHAMMAD ASLAM
  • George Leitmann
  • ASLAM NOOR
چکیده

Variational inequality theory besides being elegant, exciting and rich, also provides us a unified and natural framework to study a large class of linear and nonlinear problems arising in mathematical and engineering sciences. Equally important is the area of operations research known as complementarity theory, which has received much attention during the last twenty years. It has been shown by Karamardian [ 11, that if the convex set involved in a variational inequality problem and complementarity problem is a convex cone, then both problems are equivalent. In fact, variational inequality problems are more general than the complementarity problems, and incluce them as special cases. Recently various extensions and generalizations of the variational inequality and complementarity problems have been introduced and analyzed. An important and useful generalization of the variational inequality problems is the mildly nonlinear variational inequality problem introduced and studied by Noor [2,3]. On the other hand, the complementarity problem has also been extended by Karamardian [l] and Dolcetta [4] to the generalized complementarity problem and the quasi (implict) complementarity problem. For related work and applications, see Ahn [S], Crank [6], Mangasarian [7], and Noor [S].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

متن کامل

An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function

In this paper, an interior-point algorithm  for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...

متن کامل

On Vector Equilibrium Problem with Generalized Pseudomonotonicity

In this paper, first a short history of the notion of equilibrium problem in Economics and Nash$acute{'}$ game theory is stated. Also the relationship between equilibrium problem among important mathematical problems like optimization problem, nonlinear programming, variational inequality problem, fixed point problem and complementarity problem is given. The concept of generalized pseudomonoton...

متن کامل

A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem

‎A full Nesterov-Todd (NT) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using Euclidean Jordan algebra‎. ‎Two types of‎ ‎full NT-steps are used‎, ‎feasibility steps and centering steps‎. ‎The‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

متن کامل

Some Results about Set-Valued Complementarity Problem

This paper is devoted to consider the notions of complementary problem (CP) and set-valued complementary problem (SVCP). The set-valued complementary problem is compared with the classical single-valued complementary problem. Also, the solution set of the set-valued complementary problem is characterized. Our results illustrated by some examples. This paper is devoted to co...

متن کامل

An Unconstrained Optimization Technique for Nonsmooth Nonlinear Complementarity Problems

In this article, we consider an unconstrained minimization formulation of the nonlinear complementarity problem NCP(f) when the underlying functions are H-differentiable but not necessarily locally Lipschitzian or directionally differentiable. We show how, under appropriate regularity conditions on an H-differential of f , minimizing the merit function corresponding to f leads to a solution of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003